/*
 * CCVisu is a tool for visual graph clustering
 * and general force-directed graph layout.
 * This file is part of CCVisu. 
 * 
 * Copyright (C) 2005-2010  Dirk Beyer
 * 
 * CCVisu is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * CCVisu is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with CCVisu; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 * 
 * Please find the GNU Lesser General Public License in file
 * license_lgpl.txt or http://www.gnu.org/licenses/lgpl.txt
 * 
 * Dirk Beyer    (firstname.lastname@uni-passau.de)
 * University of Passau, Bavaria, Germany
 */

package ccvisu;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

/*****************************************************************
 * Contains the representation of a graph.
 * This class is a collection of the data structures needed 
 * for layout and transformation processing.
 * @version  $Revision: 1.23 $; $Date: 2007/12/15 01:20:50 $
 * @author   Dirk Beyer
 *****************************************************************/
public class GraphData {
  /** Maps a vertex id to a GraphVertex.*/
  public List<GraphVertex>        vertices     = new ArrayList<GraphVertex>();
  /** Maps a vertex name to a GraphVertex.*/
  public Map<String, GraphVertex> nameToVertex =
                                                 new HashMap<String, GraphVertex>();
  /** Edges of type GraphEdgeInt. Only used if (inFormat < LAY).*/
  public List<GraphEdge>          edges        = new ArrayList<GraphEdge>();

  /** Raw RSF data as extracted from input. */
  public Relation                 mTuples      = new Relation();
};
